On Bijections vs. Unary Functions
نویسنده
چکیده
A set of nite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quan-tiication is over relations of arity 2. In DLS95] subclasses of Binary NP were considered, in which the second order quantiiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in a three-level linear hierarchy , the levels of which are represented by bijections, successor relations and unary functions respectively. In this paper it is shown that { Graph Connectivity is expressible by bijections, thereby showing that the two lower levels of the hierarchy coincide; { the set of graphs with exactly as many vertices as arcs is expressible by unary functions but not by bijections. This shows that level 3 is strictly stronger than the other two levels.
منابع مشابه
Maximal Clones on Uncountable Sets That Include All Permutations
We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We th...
متن کاملOn Efficient Bijections between Permutations and Functions
We explore efficient surjections and bijections between sets of functions and sets of permutations. These mappings are efficient in the sense that with only a few evaluations (polynomial in the size of inputs) of a black box representing either a function or permutation, we can evaluate the corresponding permutation or function for a particular input. It is not obvious that such efficient surje...
متن کاملDifferentially 4-uniform bijections by permuting the inverse function
Block ciphers use Substitution boxes (S-boxes) to create confusion into the cryptosystems. Functions used as S-boxes should have low differential uniformity, high nonlinearity and algebraic degree larger than 3 (preferably strictly larger). They should be fastly computable; from this viewpoint, it is better when they are in even number of variables. In addition, the functions should be bijectio...
متن کاملNew Construction of Differentially 4-Uniform Bijections
Block ciphers use Substitution boxes (S-boxes) to create confusion into the cryptosystems. For resisting the known attacks on these cryptosystems, the following criteria for functions are mandatory: low differential uniformity, high nonlinearity and not low algebraic degree. Bijectivity is also necessary if the cipher is a Substitution-Permutation Network, and balancedness makes a Feistel ciphe...
متن کاملOn Two Infinite Families of Pairing Bijections
We describe two general mechanisms for producing pairing bijections (bijective functions defined from N2 → N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct pairing bijections. The second mechanism, using characteristic functions of subsets of N provides 2N distinct pairing bijections. Mechanisms to combine such pairin...
متن کامل